Real number computation with committed choice logic programming languages

Real number computation with committed choice logic programming languages

Optimizing Clause Matching Automata in Committed-choice Languages

We introduce a formalism for clause matching in concurrent committed-choice languages based on the construction of clause matching automata, a heuristic for the compilation of clause matching, and a technique for more eecient implementation of matches. The formalism is notable for its generality and simplicity, the heuristic for combining important advantages of several existing heuristics. The...

Parallel Programming with Logic Languages: A Survey

Formal properties of logic languages are largely studied; however, their impact on the practice of software design and programming is currently minimal. In this paper we survey some interesting representatives of the family of logic languages aiming at comparing the different capabilities they offer for designing and programming parallel systems. The logic languages Prolog, Aurora, Flat Concurr...

Strategies for Logic Programming Languages

Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. We brieey review the main problems, which are questions that are still elusive in the design of logic programming languages, from a proof-theoretic point of view. Existing strategies which lead to the various languages are all rath...

Logic and Agent Programming Languages

Agent programming languages based on the Belief, Desire and Intentions (BDI) framework present some interesting challenges for logicians. While BDI logics have been studied extensively, problems related to belief update and analysis of plans in BDI agent programming languages have received less attention.